On Approximate Bisimulation for Polynomial Algebraic Transition Systems

Approximate bisimulation relations for constrained linear systems

In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems are and remain identical, approximate bisimulation allows the observations to be different provided the distance between them remains bounded by some parameter called precision. Approximate bisimulation relations are conv...

Compositionality of Approximate Bisimulation for Probabilistic Systems

Probabilistic transition system specifications using the rule format ntμfθ/ntμxθ provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respec...

Labelled Transition Systems Bisimulation and Distributed Bisimulation Algebraic Characterisation of Distributed Bisimulation Weak Observations Weak Distributed Bisimulation Algebraic Characterisation of Weak Distributed Bisimulation Communication as Mutual Observation towards an Algebraic Characterisation of Weak Distributed Bisimulation with Communication Castellani

In this paper, I will describe and critically evaluate the paper Distributed Bisimulations, by Ilaria Castellani and Matthew Hennessy [5]. The aim of their paper is to generalise bisimulation equivalence for a subset of CCS to take into account the distributed nature of processes and, thus give a noninterleaving semantic theory which has many of the advantages of the interleaving theory. This t...

Extended Transition Systems for Parametric Bisimulation

Approximate Bisimulation for Switching Delays in Incrementally Stable Switched Systems

Time delays pose an important challenge in networked control systems, which are now ubiquitous. Focusing on switched systems, we introduce a framework that provides an upper bound for errors caused by switching delays. Our framework is based on approximate bisimulation, a notion that has been previously utilized mainly for symbolic (discrete) abstraction of state spaces. Notable in our framewor...